Wedgelets: nearly minimax estimation of edges
نویسندگان
چکیده
منابع مشابه
Wedgelets: Nearly-Minimax Estimation of Edges
We study a simple “Horizon Model” for the problem of recovering an image from noisy data; in this model the image has an edge with α-Hölder regularity. Adopting the viewpoint of computational harmonic analysis, we develop an overcomplete collection of atoms called wedgelets, dyadically organized indicator functions with a variety of locations, scales, and orientations. The wedgelet representati...
متن کاملNearly Optimal Minimax Tree Search?
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees aren’t uniform, the exact size of this tree isn’t known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is ...
متن کاملUniversity of Alberta Nearly Optimal Minimax Tree
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees aren’t uniform, the exact size of this tree isn’t known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is ...
متن کاملMinimax Manifold Estimation
We find the minimax rate of convergence in Hausdorff distance for estimating a manifold M of dimension d embedded in R given a noisy sample from the manifold. Under certain conditions, we show that the optimal rate of convergence is n−2/(2+d). Thus, the minimax rate depends only on the dimension of the manifold, not on the dimension of the space in which M is embedded.
متن کاملUniversity of Alberta Nearly Optimal Minimax Tree Search ?
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees aren’t uniform, the exact size of this tree isn’t known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1999
ISSN: 0090-5364
DOI: 10.1214/aos/1018031261